#include<bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin>>n;
  vector<int> vec(n);
  for(int i=0; i<n;++i) {
    vec[i]=i+1;
  }
  vec[0]=2;
  vec[1]=1;
  bool has = false;
  do {
    bool is = true;
    for(int i=1;i<n;++i) {
      if(vec[i]-vec[i-1]==1) {
        is = false;
        break;
      }
    }
    if(is) {
        has = true;
        for(int el:vec) {
          cout << el << " ";
        }
        cout << endl;
    }
  }while(!has && next_permutation(vec.begin(), vec.end()));
  if(!has) {
    cout << "NO SOLUTION\n";
  }
  return 0;
}
